A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition
نویسندگان
چکیده
منابع مشابه
A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition
The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches:the decision-theoretic approach and the syntactic (structural) approach. In this paper,at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in syntactic pattern recognition called top –d...
متن کاملTop-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly used statistical parsers use context-free dynamic programming algorithms and as such work bottom up on the entire sentence. Thus they only find a complete fully connected parse at the very end. In contrast, both subjec...
متن کاملA New Top-Down Parsing Algorithm for Left-Recursive DCGs
Abs t rac t . In this paper we introduce a new parsing algorithm, called cancellation parsing. Deterministic cancellation parsing with lookahead k can handle the C(k) grammars, which include the LL(k) grammars and are contained in the LC(k) grammars. The C(k) property is of theoretical interest in that it shows how to formalize the intuitive notion of the LL(k) property extended with the possib...
متن کاملTop-Down Parsing with Parsing Contexts A Simple Approach to Context-Sensitive Parsing
The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge. Implementors of programming language parsers...
متن کاملThe employment of Prolog for a syntax analysis in syntactic pattern recognition applications
In the paper some possibilities of the employment of Prolog for a syntax analysis of context-free languages are shown with respect to syntactic pattern recognition applications. The new syntax-analyzer based on "top-down" strategy is proposed. All terminal symbols contained on a right side of a production of a context-free grammar are used for the decision whether or not the production shall be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12157-7943